منابع مشابه
Nominal Monoids
We investigate different notions of nominal words, that is, words that my contain letters from an alphabet as well as names and name-binders. In a first section we construct them from first principles. In a second section we take the point of view that—as in the classical case—words over an alphabet S form a free monoid over S. We define different notions of nominal monoids and reveal nominal w...
متن کاملGarside monoids vs divisibility monoids
Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of common multiples) is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations (resp. be of Coxeter ty...
متن کاملOrdered monoids and J-trivial monoids
In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...
متن کاملCartesian Monoids
The Cartesian monoid of partial piecewise shift operators is developed as a model for programming systems such as Backus’ FP. Special attention is paid to those elements which are equationally implicitly definable.
متن کاملData Monoids
We develop an algebraic theory for languages of data words. We prove that, under certain conditions, a language of data words is definable in first-order logic if and only if its syntactic monoid is aperiodic. 1 Introduction This paper is an attempt to combine two fields. The first field is the algebraic theory of regular languages. In this theory, a regular language is represented by its synta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2013
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-013-9464-1